How to use Information Theory for Image Inpainting and Blind Spot Filling-in?
نویسندگان
چکیده
This paper shows how information theory can both drive the digital image inpainting process and the optical illusion due to the blind spot. The defended position is that the missing information is padded by the “most probable information around” via a simple filling-in scheme. Thus the proposed algorithm aims to keep the entropy constant. It cares not to create too much novelty as well as not to destroy too much information. For this, the image is broken down into regular squares in order to build a dictionary of unique words and to estimate the entropy. Then the occluded region is completed, word by word and layer by layer, by picking the element which respects the existing image, which minimizes the entropy deviation if there are several candidates, and which limits its potential increase in the case where no compatible word exists and where a new one must be introduced.
منابع مشابه
Improving Exemplar-based Image Completion methods using Selecting the Optimal Patch
Image completion is one of the subjects in image and video processing which deals with restoration of and filling in damaged regions of images using correct regions. Exemplar-based image completion methods give more pleasant results than pixel-based approaches. In this paper, a new algorithm is proposed to find the most suitable patch in order to fill in the damaged parts. This patch selection ...
متن کاملImage Restoration by Variable Splitting based on Total Variant Regularizer
The aim of image restoration is to obtain a higher quality desired image from a degraded image. In this strategy, an image inpainting method fills the degraded or lost area of the image by appropriate information. This is performed in such a way so that the obtained image is undistinguishable for a casual person who is unfamiliar with the original image. In this paper, different images are degr...
متن کاملImage Restoration and Inpainting Using Belief Propagation with Dynamic Pruning Optimized Exemplar Algorithm
One of the most important premises of research in image processing happens to be Image inpainting which is a technique to fill missing region or reconstruct damaged area in an image. Through image inpainting one can also remove an undesirable object from an image in visually plausible way. For filling the part of image, it uses information from the neighboring area. In this paper, we present an...
متن کاملفشردهسازی تصویر با کمک حذف و کدگذاری هوشمندانه اطلاعات تصویر و بازسازی آن با استفاده از الگوریتم های ترمیم تصویر
Compression can be done by lossy or lossless methods. The lossy methods have been used more widely than the lossless compression. Although, many methods for image compression have been proposed yet, the methods using intelligent skipping proper to the visual models has not been considered in the literature. Image inpainting refers to the application of sophisticated algorithms to replace lost o...
متن کاملLearning How to Inpaint from Global Image Statistics
Inpainting is the problem of filling-in holes in images. Considerable progress has been made by techniques that use the immediate boundary of the hole and some prior information on images to solve this problem. These algorithms successfully solve the local inpainting problem but they must, by definition, give the same completion to any two holes that have the same boundary, even when the rest o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013